Relative entropy under mappings by stochastic matrices
نویسندگان
چکیده
منابع مشابه
Genetic code, attributive mappings and stochastic matrices.
In this paper we construct three primitive mappings based on three kinds of genetic attribute equivalences. We then apply the mappings and basic addition operation to the universal genetic code to generate three square matrices. We show that these square matrices are stochastic in nature. They demonstrate some fractal similarity properties and resemble the similar properties to the original sto...
متن کاملRelative entropy between Markov transition rate matrices
We derive the relative entropy between two Markov transition rate matrices from sample path considerations. This relative entropy is interpreted as a \level 2.5" large deviations action functional. That is, the level two large deviations action functional for empirical distributions of continuous-time Markov chains can be derived from the relative entropy using the contraction mapping principle...
متن کاملCalibrating Arbitrage-Free Stochastic Volatility Models by Relative Entropy Method
We develop a new framework to calibrate stochastic volatility option pricing models to an arbitrary prescribed set of prices of liquidly traded options. Our approach produces an arbitrage-free stochastic volatility di usion process that minimizes the distance to a prior di usion model. We use the notion of relative entropy (also known under the name of Kullback-Leibler distance) to quantify the...
متن کاملSubadditivity of Entropy for Stochastic Matrices
The entropy of irreducible stochastic matrix measures its mixing properties. We show that this quantity is subadditive and strongly subadditive. 1Instytut Matematyki Uniwersytet Jagielloński Reymonta 4, 30-059 Kraków, Poland mail: [email protected] 1 1 Preliminaries Let N ∈ N. We denote the simplex of probability vectors (finite probability distributions) by ∆N = { p ∈ R : pi ≥ 0 for i = 1,...
متن کاملAccurate Computation of the Relative Entropy Between Stochastic Regular Grammars
Works dealing with grammatical inference of stochastic grammars often evaluate the relative entropy between the model and the true grammar by means of large test sets generated with the true distribution. In this paper, an iterative procedure to compute the relative entropy between two stochastic deterministic regular grammars is proposed. Resumé Les travails sur l’inférence de grammaires stoch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1993
ISSN: 0024-3795
DOI: 10.1016/0024-3795(93)90331-h